Theo-primitive components of a regular ordered permutation group

A permutation group determined by an ordered set

Let P be a finite ordered set, and let J(P ) be the distributive lattice of order ideals of P . The covering relations of J(P ) are naturally associated with elements of P ; in this way, each element of P defines an involution on the set J(P ). Let Γ(P ) be the permutation group generated by these involutions. We show that if P is connected then Γ(P ) is either the alternating or the symmetric ...

Regular ordered semigroups and intra-regular ordered semigroups in terms of fuzzy subsets

Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping   from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper,  the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...

Distinguishing Primitive Permutation Groups

Let G be a permutation group acting on a set V . A partition π of V is distinguishing if the only element of G that fixes each cell of π is the identity. The distinguishing number of G is the minimum number of cells in a distinguishing partition. We prove that if G is a primitive permutation group and |V | ≥ 336, its distinguishing number is two.

QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

Factorizations of Primitive Permutation Groups